Efficiency Considerations of an Offline Mobile Robot Path Planner

نویسندگان

  • Pejman Kamkarian
  • Henry Hexmoor
چکیده

The aim of disseminating this research article is to showcase a novel path planner method, which is shown to be an efficient offline path planner in terms of its capacity for analyzing workspace robot maneuvering skills and constructing collision free trajectories that yield the shortest possible path from initial point toward goal configuration. The determined route is considered to be adequately secure such that it enables the mobile robot to maneuver among obstacles in the workspace without dangers of encountering a near miss. In addition, this paper evaluates our novel path planner algorithm abilities and skills by examining it against different workspaces. We assess our novel path planner by comparing it to two of the most popular planners with the purpose of revealing its capability to route trajectories in regards to building optimal trajectory distances from initial to the goal configurations. Keywords— Path planning, Rapidly Optimizing Mapper, Robot path planning, Robot trajectory builder

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Spatio-temporal A* algorithms for offline multiple mobile robot path planning

This paper presents an offline collision-free path planning algorithm for multiple mobile robots using a 2D spatial-time map. In this decoupled approach, a centralized planner uses a SpatioTemporal A* algorithm to find the lowest time cost path for each robot in a sequentially order based on its assigned priority. Improvements in viable path solutions using wait time insertion and adaptive prio...

متن کامل

An Analysis for a Novel Path Planning Method

A robot is basically a collection of many different units, with the purpose of achieving desirable goals assigned by human users. Depending on the robot complexity, it is able to perform a broad range and variety of missions with minimizing control from a human user. Robots, as important entities, are going to find their place in different manmade constructions in both industrial and everyday l...

متن کامل

An Analysis for a Novel Path Planning Method

A robot is basically a collection of many different units, with the purpose of achieving desirable goals assigned by human users. Depending on the robot complexity, it is able to perform a broad range and variety of missions with minimizing control from a human user. Robots, as important entities, are going to find their place in different manmade constructions in both industrial and everyday l...

متن کامل

An Analysis for a Novel Path Planning Method

A robot is basically a collection of many different units, with the purpose of achieving desirable goals assigned by human users. Depending on the robot complexity, it is able to perform a broad range and variety of missions with minimizing control from a human user. Robots, as important entities, are going to find their place in different manmade constructions in both industrial and everyday l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015